Adelfa: A System for Reasoning about LF Specifications
نویسندگان
چکیده
We present a system called Adelfa that provides mechanized support for reasoning about specifications developed in the Edinburgh Logical Framework or LF. Underlying is new logic named L_LF. Typing judgements LF are represented by atomic formulas L_LF and quantification permitted over contexts terms appear such formulas. Contexts, which constitute type assignments to uniquely variables modelled using technical device of nominal constants, characterized context schemas describe their inductive structure. these an associated semantics before sketching proof constructing arguments sound with respect semantics. then outline realization this illustrate its use through few example developments. conclude paper relating existing systems specifications.
منابع مشابه
Abella: A System for Reasoning about Relational Specifications
Concrete Precedence/ Associativity Types (τ) Atomic types prop, nat, list, . . . Arrow types τ1 → τ2 T1 -> T2 right Terms (m,n) Variables x, y, . . . x, y, . . . Constants c, d, . . . c, d, . . . Nominal constants n1, n2, . . . n1, n2, . . . (n followed by at least one digit) Abstractions λx.m x\ M 0, right λx:τ.m x:T\ M 0, right Applications m n M N 5, left Formulas (A,B) Logical constants >,⊥...
متن کاملReasoning about Object-Z Specifications
This paper presents a method of reasoning about Object-Z speciications. The approach utilises the modularity inherent in Object-Z speciications to simplify proofs. Properties proved for a class in isolation can be used when that class is either inherited by another class or instantiated as part of a system of interacting objects. Proofs using structural induction and the notion of object integr...
متن کاملReasoning About Method Calls in JML Specifications
The Java Modeling Language, JML, is an interface specification language that uses side-effect free Java expressions to describe program behavior. In particular, JML specifications can contain calls to side-effect free methods. To verify programs w.r.t. JML specifications, JML expressions have to be encoded in a program logic. This encoding is non-trivial for method calls. In this paper, we illu...
متن کاملReasoning Inductively about Z Specifications via Unification
Selecting appropriate induction cases is one of the major problems in proof by induction. Heuristic strategies often use the recur-sive pattern of deenitions and lemmas in making these selections. In this paper, we describe a general framework, based upon uniication, that encourages and supports the use of such heuristic strategies within a Z-based proof system. The framework is general in that...
متن کاملReasoning About Method Calls in Interface Specifications
class Inconsistent { /*@ normal_behavior @ ensures \result == 0 && @ \result == 1; @*/ /*@ pure @*/ abstract int wrong(); /*@ normal_behavior @ assignable \nothing; @ ensures \result == 6 + wrong() && @ \result == 5 + wrong(); @*/ int bar() { return 6; } } Figure 6: The specification of wrong is not satisfiable. theory used to verify methods that use m in their specification. If this background...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic proceedings in theoretical computer science
سال: 2021
ISSN: ['2075-2180']
DOI: https://doi.org/10.4204/eptcs.337.8